Solving Minimum Vertex Cover : A Fast Fixed - Parameter - Tra table Algorithm for Pro t Cover ?
نویسنده
چکیده
منابع مشابه
An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover
We introduce the problem Profit Cover which finds application in, among other areas, psychology of decision-making. A common assumption is that net value is a major determinant of human choice. Profit Cover incorporates the notion of net value in its definition. For a given graph G = (V,E) and an integer p > 0, the goal is to determine PC ⊆ V such that the profit, |E′| − |PC|, is at least p, wh...
متن کاملExperimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Many NP-complete problems on planar graphs are “fixed-parameter tractable:” Recent theoretical work provided tree decomposition based fixed-parameter algorithms exactly solving various parameterized problems on planar graphs, among others Vertex Cover, in time O(c √ kn). Here, c is some constant depending on the graph problem to be solved, n is the number of graph vertices, and k is the problem...
متن کاملExact Algorithms for Generalizations of Vertex Cover
The NP-complete Vertex Cover problem has been intensively studied in the field of parameterized complexity theory. However, there exists only little work concerning important generalizations of Vertex Cover like Partial Vertex Cover, Connected Vertex Cover, and Capacitated Vertex Cover which are of high interest in theory as well as in real-world applications. So far research was mainly focused...
متن کاملOn Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
We investigate the fixed parameter complexity of one of the most popular problems in combinatorial optimization, Weighted Vertex Cover. Given a graph G = (V, E), a weight function ω : V → R, and k ∈ R, Weighted Vertex Cover (WVC for short) asks for a subset C of vertices in V of weight at most k such that every edge of G has at least one endpoint in C. WVC and its variants have all been shown t...
متن کاملParameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters
Let G be a graph such that each vertex has its list of available colors, and assume that each list is a subset of the common set consisting of k colors. For two given list colorings of G, we study the problem of transforming one into the other by changing only one vertex color assignment at a time, while at all times maintaining a list coloring. This problem is known to be PSPACE-complete even ...
متن کامل